An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
نویسندگان
چکیده
منابع مشابه
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct soluti...
متن کاملA cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملAn Effective Hybrid Ant Colony Optimization for Permutation Flow-Shop Scheduling
This paper proposes a hybrid ant colony optimization algorithm to solve the permutation flow-shop scheduling (PFS). The hybridization of ant colony optimization (ACO) with path relinking (PR), which combines the advantages of two individual algorithms, is the key innovative aspect of the approach. Path relinking (PR) can be interpreted as an evolutionary method where the high quality solutions ...
متن کاملThe Development of Simulated Annealing Algorithm for Hybrid Flow Shop Scheduling Problem to Minimize Makespan and Total Tardiness
Hybrid Flowshop Scheduling (HFS) is one of the most comprehensively studied in scheduling problems. HFS has m-machines in each stage so that it is more complicated that regular flowshop scheduling. There are several production systems using HFS, such as steel manufacture, textile, and paper industry [8] [15]. Makespan and total tardiness are two important goals in scheduling to make the schedul...
متن کاملAn Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advances in Intelligent Informatics
سال: 2020
ISSN: 2548-3161,2442-6571
DOI: 10.26555/ijain.v6i1.385